Prediction of K-Means Multivariable Rice Production Center Pattern
نویسندگان
چکیده
Abstract West Sumatra is one of the provinces that have potential to be used as a rice production center in Indonesia. However, determination local centers still justified based on conventional methods. This study aims obtain historical data variables, process using K-Means algorithm (RStudio), and justify areas given year acquisition recommendation values (centroids). The results showed 2010-2020, best number clusters (elbow graph) was K=3. highest value final centroid lies 3 so 8 recommendations for districts are obtained, including Padang Pariaman Regency, Pesisir Selatan Tanah Datar Agam Solok Fifty Cities Pasaman South Regency. Furthermore, eight included Governor’s Decree no. 525-757-2021 concerning food areas. Based 2019 irrigation network performance index decision-supporting variable, reached Batang Surantih area, with an 15 (100%).
منابع مشابه
Crime Prediction using K-means Algorithm
Crime analysis and prevention is a systematic approach for identifying and analyzing patterns and trends in crime. Our system can predict regions which have high probability for crime occurrence and can visualize crime prone areas. With the increasing advent of computerized systems, crime data analysts can help the Law enforcement officers to speed up the process of solving crimes. About 10% of...
متن کاملStock Trend Prediction by Using K-Means and AprioriAll Algorithm for Sequential Chart Pattern Mining
In this paper we present a model to predict the stock trend based on a combination of sequential chart pattern, K-means and AprioriAll algorithm. The stock price sequence is truncated to charts by sliding window, then the charts are clustered by K-means algorithm to form chart patterns. Therefore, the chart sequences are converted to chart pattern sequences, and frequent patterns in the sequenc...
متن کاملCluster center initialization algorithm for K-means clustering
Performance of iterative clustering algorithms which converges to numerous local minima depend highly on initial cluster centers. Generally initial cluster centers are selected randomly. In this paper we propose an algorithm to compute initial cluster centers for K-means clustering. This algorithm is based on two observations that some of the patterns are very similar to each other and that is ...
متن کاملA fast k-means clustering algorithm using cluster center displacement
In this paper, we present a fuzzy k-means clustering algorithm using the cluster center displacement between successive iterative processes to reduce the computational complexity of conventional fuzzy k-means clustering algorithm. The proposed method, referred to as CDFKM, first classifies cluster centers into active and stable groups. Our method skips the distance calculations for stable clust...
متن کاملPersistent K-Means: Stable Data Clustering Algorithm Based on K-Means Algorithm
Identifying clusters or clustering is an important aspect of data analysis. It is the task of grouping a set of objects in such a way those objects in the same group/cluster are more similar in some sense or another. It is a main task of exploratory data mining, and a common technique for statistical data analysis This paper proposed an improved version of K-Means algorithm, namely Persistent K...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IOP conference series
سال: 2023
ISSN: ['1757-899X', '1757-8981']
DOI: https://doi.org/10.1088/1755-1315/1182/1/012078